Counting Affine Calculator and Applications

نویسنده

  • Sven Verdoolaege
چکیده

We present an interactive tool, called iscc, for manipulating sets and relations of integer tuples bounded by affine constraints over the set variables, parameters and existentially quantified variables. A distinguishing feature of iscc is that it provides a cardinality operation on sets and relations that computes a symbolic expression in terms of the parameters and domain variables for the number of elements in the set or the image of the relation. In particular, these expressions are piecewise quasipolynomials, which can be further manipulated in iscc. Besides basic operations on sets and piecewise quasipolynomials, iscc also provides an interface to code generation, lexicographic optimization, dependence analysis, transitive closures and the symbolic computation of upper bounds and sums of piecewise quasipolynomials over their domains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Face Recognition using an Affine Sparse Coding approach

Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...

متن کامل

Characterizing Global Minimizers of the Difference of Two Positive Valued Affine Increasing and Co-radiant Functions

‎Many optimization problems can be reduced to a problem with an increasing and co-radiant objective function by a suitable transformation of variables. Functions, which are increasing and co-radiant, have found many applications in microeconomic analysis. In this paper, the abstract convexity of positive valued affine increasing and co-radiant (ICR) functions are discussed. Moreover, the ...

متن کامل

Silkworm Egg Counting System Using Image Processing Algorithm - A Review

so production of silkworm from silkworm egg rapidly increasing. Success of sericulture as a cash crop depends on the vitality and disease freeness of the silkworm seed applied to farmer. Production of silkworm seed is not only free from diseases but having high heterosis. It is necessary to count silkworm egg accurately to avoid loss to silkworm egg production industry and farmers or grainges. ...

متن کامل

Harmonic Analysis, Ergodic Theory and Counting for Thin Groups

For a geometrically finite group Γ of G = SO(n, 1), we survey recent developments on counting and equidistribution problems for orbits of Γ in a homogeneous space H\G where H is trivial, symmetric or horospherical. Main applications are found in an affine sieve on orbits of thin groups as well as in sphere counting problems for sphere packings invariant under a geometrically finite group. In ou...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011